CSG Feature Trees from Engineering Sketches of Polyhedral Shapes
نویسندگان
چکیده
We give a method to obtain a 3D CSG model from a 2D engineering wireframe sketch which depicts a polyhedral shape. The method finds a CSG feature tree compatible with a reverse design history of a 2D line-drawing obtained by vectorising the sketch. The process used seeks the CSG feature tree recursively, combining all design or manufacturing features embedded in the sketch, proceeding in reverse order from the most detailed features to the blank.
منابع مشابه
A Method for Reconstructing Sketched Polyhedral Shapes with Rounds and Fillets
In this paper we present a method for detecting rounds and fillets in engineering sketches and drawings, and automatically generating a 3D model of the corresponding object, with rounds and fillets applied. This method is useful both as a component of computer-aided sketching tools and in determining design intent—although rounds and fillets are common in engineering parts, they often conceal d...
متن کاملPerceiving Ribs in Single-View Wireframe Sketches of Polyhedral Shapes
As part of a strategy for creating 3D models of engineering objects from sketched input, we attempt to identify design features, geometrical structures within objects with a functional meaning. Our input is a 2D B-Rep derived from a single view sketch of a polyhedral shape. In this paper, we show how to use suitable cues to identify algorithmically two additive engineering design features, angu...
متن کاملEnvisioning sketch recognition: a local feature based approach to recognizing informal sketches
Hand drawn sketches are an important part of the early design process and are an important aspect of creative design. They are used in many elds including electrical engineering, software engineering and web design. Recognizing shapes in these sketches is a challenging task due to the imprecision with which they are drawn. We tackle this challenge with a visual approach to recognition. The appr...
متن کاملR O M a Dimension-independent Bsp (2): Boundary to Interior Mapping
In this paper we discuss a CSG/BSP algorithm to perform the conversion from the boundary to the interior of d-dimensional polyhedra. Both a d-dimensional polyhedral point-set and its boundary (d 1)-faces are here represented as BSP trees. In this approach no structure, no ordering and even no orientation is required for such boundary BSP trees. In particular it is shown that the interior point-...
متن کاملDimension-Independent BSP (2): boundary-to-interior Mapping
In this paper we discuss a CSG BSP algorithm to perform the conversion from the boundary to the interior of d dimensional polyhedra Both a d dimensional polyhedral point set and its boundary d faces are here represented as BSP trees In this approach no structure no ordering and even no orientation is required for such boundary BSP trees In particular it is shown that the interior point set may ...
متن کامل